Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
51	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Open Problems from CCCG 2005 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:54 Discrete geometry Euclidean plane geometry Computational geometry NP-complete problems K-set 3SUM Pseudotriangle Planar graph Dominating set Graph theory Mathematics Geometry
52	Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:49:42 NP-complete problems Parameterized complexity Exponential time hypothesis Dominating set Tree decomposition Vertex cover Graph coloring Equitable coloring Clique Theoretical computer science Graph theory Mathematics
53	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
54	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics
55	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
56	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
57	PDF Document Add to Reading List Source URL: www.psi.toronto.edu Language: English - Date: 2014-04-30 16:04:07 NP-complete problems Probability theory Operations research Belief propagation Coding theory Fourier transform Combinatory logic Dominating set Linear programming Theoretical computer science Mathematics Applied mathematics
58	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
59	C:/Documents and Settings/Arik Motskin/Desktop/CCCG/cds_cccg_paper.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Network flow Dominating set Graph Flow network Connectivity Topology Tree decomposition Centrality Graph theory Mathematics Theoretical computer science
60	Introduction Power Domination Network and Attack Models Structural Controllability under Vertex Removal Conclusions and Future Work Add to Reading List Source URL: www.critis2013.nl Language: English - Date: 2013-09-21 17:44:33 Control theory Graph theory NP-complete problems Controllability Dominating set Vertex Graph Network theory Network controllability Mathematics Theoretical computer science Applied mathematics

UPDATE